Numerically-robust O(N2) RLS algorithms using least-squares prewhitening
نویسنده
چکیده
منابع مشابه
A fully pipelined RLS-based array for channel equalization
It is shown that several recursive least squares (RLS) type equalization algorithms such as, e.g., decision-directed schemes and ‘orthogonalized’ constant modulus algorithms, possess a common algorithmic structure and are therefore rather straightforwardly implemented on an triangular array (filter structure) for RLS estimation with inverse updating. While the computational complexity for such ...
متن کاملA Systolic Array for Recursive Least Squares Computations - Part II : Mapping directionally weighted RLS on an SVD updating array
In an earlier paper, a systolic algorithm/array was derived for recursive least squares (RLS) estimation, which achieves an O(n0) throughput rate with O(n2) parallelism. The resulting array is specifically tuned towards the RLS problem. Here, a different route is taken, by trying to implement the RLS problem on a systolic array, which is also useful for several other applications, such as, e.g....
متن کاملNumerically stable fast convergence least-squares algorithms for multichannel active sound cancellation systems and sound deconvolution systems
In recent years, recursive least-squares (RLS) algorithms and fast-transversal-.lters (FTF) algorithms have been introduced for multichannel active sound cancellation (ASC) systems and multichannel sound deconvolution (MSD) systems. It was reported that these algorithms can greatly improve the convergence speed of the ASC=MSD systems using adaptive FIR .lters. However, numerical instability of ...
متن کاملAlgorithms and Architectures for Split Recursive Least Squares
In this paper, a new computationally efficient algorithm for recursive least-squares (RLS) filtering is presented. The proposed Split RLS algorithm can perform the approximated RLS with O ( N ) complexity for signals having no special data structure t o be exploited. Our performance analysis shows that the estimation bias will be small when the input data are less correlated. We also show that ...
متن کاملSplit Recursive Least Squares: Algorithms, Architectures, and Applications
In this paper, a new computationally eecient algorithm for recursive least-squares (RLS) l-tering is presented. The proposed Split RLS algorithm can perform the approximated RLS with O(N) complexity for signals having no special data structure to be exploited, while avoiding the high computational complexity (O(N 2)) required in the conventional RLS algorithms. Our performance analysis shows th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000